Stochastic Ambient Calculus

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stochastic Ambient Calculus

Mobile Ambients (MA) have acquired a fundamental role in modelling mobility in systems with mobile code and mobile devices, and in computation over administrative domains. We present the stochastic version of Mobile Ambients, called Stochastic Mobile Ambients (SMA), where we extend MA with time and probabilities. Inspired by previous models, PEPA and Sπ, we enhance the prefix of the capabilitie...

متن کامل

Stochastic Calculus

The following notes aim to provide a very informal introduction to Stochastic Calculus, and especially to the Itô integral and some of its applications. They owe a great deal to Dan Crisan's Stochastic Calculus and Applications lectures of 1998; and also much to various books especially those of L. C. G. Rogers and D. Williams, and Dellacherie and Meyer's multi volume series 'Probabilities et P...

متن کامل

Types for the Ambient Calculus

The ambient calculus is a concurrent calculus where the unifying notion of ambient is used to model many different constructs for distributed and mobile computation. We study a type system that describes several properties of ambient behavior. The type system allows ambients to be partitioned in disjoint sets (groups), according to the intended design of a system, in order to specify both the c...

متن کامل

A Dependently Typed Ambient Calculus

The Ambient calculus is a successful model of distributed, mobile computation, and has been the vehicle of new ideas for resource access control. Mobility types have been used to enforce elementary access control policies, expressed indirectly via classification of ambients in groups by means of ‘group types.’ The paper presents a theory of dependent types for the Ambient calculus which allows ...

متن کامل

An Expanded Ambient Calculus with Π-calculus Embedding

Formal methods is the branch of computer science most concerned with the mathematical formalization of computational frameworks and the specification of programs and programming languages. The formulation of computability most familiar to an undergraduate is most likely the Turing machine, which models computation in a way intuitive to the layperson; a Turing machine consists of a malleable tap...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Notes in Theoretical Computer Science

سال: 2006

ISSN: 1571-0661

DOI: 10.1016/j.entcs.2006.07.018